Implementation of a quantum search algorithm on a quantum computer

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer

The simulation of quantum mechanical systems with classical computers appears to be a computationally intractable problem. In 1982 Feynman reversed this observation, suggesting that quantum mechanical systems have an information processing capability much greater than that of corresponding classical systems, and thus could be used to implement a new type of powerful computer. In 1985 Deutsch de...

متن کامل

Implementation of a Quantum Algorithm to Solve Deutsch’s Problem on a Nuclear Magnetic Resonance Quantum Computer

Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorisation of large numbers. While the theory of quantum computing is well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance (NMR) can be used to implement sma...

متن کامل

Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer

Quantum computing shows great promise for the solution of many difficult problems, such as the simulation of quantum systems and the factorization of large numbers. While the theory of quantum computing is fairly well understood, it has proved difficult to implement quantum computers in real physical systems. It has recently been shown that nuclear magnetic resonance ~NMR! can be used to implem...

متن کامل

Experimental Implementation of Hogg’s Algorithm on a Three-Quantum-bit NMR Quantum Computer

Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found wi...

متن کامل

Implementation of a three-quantum-bit search algorithm

We report the experimental implementation of Grover’s quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of C-labeled CHFBr2, in which the three weakly coupled spin-1/2 nuclei behave as the bits and are initialized, manipulated, and read out using magnetic resonance techniques. This quantum computation is made possible by the introduction ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1998

ISSN: 0028-0836,1476-4687

DOI: 10.1038/30687